Path encoding and decoding

ABSTRACT

This invention relates to a system, method and computer program product for encoding an input string of binary characters including: a cellular data structure definition including a starting empty cell; one or more path definitions defining paths through the data structure; a character reading and writing engine for writing a binary character to an empty cell with a predefined initial position; a next cell determination engine for determining a next empty cell by methodically checking cells along one of the paths in the data structure until an empty cell is located; a loop facilitator for looping back to the writing next character step and the determining next cell step until there are no more data characters or a next empty cell is not determined; and a serialization deserialization engine for methodically serializing the data structure into a one dimensional binary string of characters representing an encoded string of alphanumeric characters.

FIELD OF THE INVENTION

This invention relates to a method and apparatus for encoding anddecoding data. In particular the invention relates to a method andapparatus for encoding and decoding data using a path through a datastructure made up of cells.

BACKGROUND

The trend for encoding and decoding text is to use ever more complexalgorithms. To this extent, increasing processing power is required toencode and decode. The logical consequence of this is to use dedicatedhardware components, but this still uses stringent computer resources(memory, computer processing cycles) and more powerful energy sources.

Mobile devices often have more constrained resource than a desktopcounterpart but often mobile applications only need a low level ofencoding. For instance, field sensors and actuators would benefit from asystem which presents a good trade-off between: reduced powerconsumption; computer resource; and security strength.

SUMMARY OF INVENTION

In a first aspect of the invention there is provided a system forencoding an input string of binary characters comprising: a cellulardata structure definition including a starting empty cell; one or morepath definitions defining paths through the data structure; a characterreading and writing engine for writing a binary character to an emptycell with a predefined initial position; a next cell determinationengine for determining a next empty cell by methodically checking cellsalong one of the paths in the data structure until an empty cell islocated; a loop facilitator for looping back to the writing nextcharacter step and the determining next cell step until there are nomore data characters or a next empty cell is not determined; and aserialization deserialization engine for methodically serializing thedata structure into a one dimensional binary string of charactersrepresenting an encoded string of alphanumeric characters.

In another aspect of the invention there is provided a method ofencoding an input string of binary characters comprising: defining acellular data structure including a starting empty cell; defining one ormore paths through the data structure; writing a binary character to anempty cell with a predefined initial position; determining a next emptycell by methodically checking cells along one of the paths in the datastructure until an empty cell is located; looping back to the writingnext character step and the determining next cell step until there areno more data characters or a next empty cell is not determined; andmethodically serializing the data structure into a one dimensionalbinary string of characters representing an encoded string ofalphanumeric characters.

According to another aspect of the invention there is provided a methodof decoding an input string of binary characters representing an encodedstring of alphanumeric characters comprising: defining a cellular datastructure including a starting current cell; defining one or more pathsthrough the data structure; populating the cells with the binarycharacters using a defined transform so that each populated cell isfull; reading a binary character from the current cell; writing it to anoutput string, and setting the current cell to empty; determining a nextfull cell by methodically traversing from the current cell to adjacentcells along the one or more paths in the data structure until a fullcell is located; looping back to the reading next character step and thedetermining next cell step until there are no more cells in the datastructure or a next full cell is not determined; and presenting theoutput string as a decoded string of alphanumeric characters.

In another aspect of the invention there is provided a computer programproduct comprising a computer-readable storage medium havingcomputer-readable program code embodied therewith, the computer-readableprogram code configured to perform a method for encoding an input stringof binary characters representing alphanumeric characters when executedby a computer system, the method comprising: defining a cellular datastructure including a starting empty cell; defining one or more pathsthrough the data structure; writing a binary character to an empty cellwith a predefined initial position; determining a next empty cell bymethodically checking cells along one of the paths in the data structureuntil an empty cell is located; looping back to the writing nextcharacter step and the determining next cell step until there are nomore data characters or a next empty cell is not determined; andmethodically serializing the data structure into a one dimensionalbinary string of characters representing an encoded string ofalphanumeric characters.

BRIEF DESCRIPTION OF THE DRAWINGS

Embodiments of the present invention will now be described, by way ofexample only, with reference to the following drawings.

FIG. 1 is a deployment diagram according to an embodiment.

FIG. 2 is a component diagram according to an embodiment.

FIG. 3A is a flow diagram of a process of the encoding method accordingto an embodiment.

FIG. 3B is a flow diagram of an example process of the encoding methodaccording to an embodiment.

FIG. 4A is a flow diagrams of a process of the decoding method accordingto an embodiment.

FIG. 4B is a flow diagrams of a process of the decoding method accordingto an embodiment.

FIG. 5A is an example diagram of path in a matrix.

FIG. 5B is an example raw stream characters and coded stream characters.

FIG. 5C is an example diagram of initial parameters used to code theexample of FIG. 5B.

FIGS. 5D, 5E and 5F are state diagrams of an example pad as it is usedto code the raw stream to the coded stream of FIG. 5B.

FIG. 6A is another example of not yet encoded raw binary stream withcorresponding coded binary stream.

FIG. 6B is a hexadecimal representation of the raw stream and codedstream of 6A.

FIG. 6C is a list of the parameters used for the coding example of 6A.

FIG. 6D is a representation of a first path (path A) matrix.

FIG. 6E is a representation of a second path (path B) matrix.

FIG. 6F is a table showing the order of filling a matrix.

FIGS. 6G, 6H, 6I and 6J are state diagrams of an example pad as it isused to code the raw stream to the coded stream of FIG. 6B.

DETAILED DESCRIPTION

Referring to FIG. 1, the deployment of n embodiment in computerprocessing system 10 is described. Computer processing system 10 isoperational with numerous other general purpose or special purposecomputing system environments or configurations. Examples of well-knowncomputing processing systems, environments, and/or configurations thatmay be suitable for use with computer processing system 10 include, butare not limited to, personal computer systems, server computer systems,thin clients, thick clients, hand-held or laptop devices, multiprocessorsystems, microprocessor-based systems, set top boxes, programmableconsumer electronics, network PCs, minicomputer systems, mainframecomputer systems, and distributed cloud computing environments thatinclude any of the above systems or devices.

Computer processing system 10 may be described in the general context ofcomputer system-executable instructions, such as program modules, beingexecuted by a computer processor. Generally, program modules may includeroutines, programs, objects, components, logic, and data structures thatperform particular tasks or implement particular abstract data types.Computer processing system 10 may be embodied in distributed cloudcomputing environments where tasks are performed by remote processingdevices that are linked through a communications network. In adistributed cloud computing environment, program modules may be locatedin both local and remote computer system storage media including memorystorage devices.

Computer processing system 10 comprises: general-purpose computer server12 and one or more input devices 14 and output devices 16 directlyattached to the computer server 12. Computer processing system 10 isconnected to a network 20. Computer processing system 10 communicateswith a user 18 using input devices 14 and output devices 16. Inputdevices 14 include one or more of: a keyboard, a scanner, a mouse,trackball or another pointing device. Output devices 16 include one ormore of a display or a printer. Computer processing system 10communicates with network devices (not shown) over network 20. Network20 can be a local area network (LAN), a wide area network (WAN), or theInternet.

Computer server 12 comprises: central processing unit (CPU) 22; networkadapter 24; device adapter 26; bus 28 and memory 30.

CPU 22 loads machine instructions from memory 30 and performs machineoperations in response to the instructions. Such machine operationsinclude: incrementing or decrementing a value in a register;transferring a value from memory 30 to a register or vice versa;branching to a different location in memory if a condition is true orfalse (also known as a conditional branch instruction); and adding orsubtracting the values in two different registers and loading the resultin another register. A typical CPU can perform many different machineoperations. A set of machine instructions is called a machine codeprogram, the machine instructions are written in a machine code languagewhich is referred to a low level language. A computer program written ina high level language needs to be compiled to a machine code programbefore it can be run. Alternatively a machine code program such as avirtual machine or an interpreter can interpret a high level language interms of machine operations.

Network adapter 24 is connected to bus 28 and network 20 for enablingcommunication between the computer server 12 and network devices.

Device adapter 26 is connected to bus 28 and input devices 14 and outputdevices 16 for enabling communication between computer server 12 andinput devices 14 and output devices 16.

Bus 28 couples the main system components together including memory 30to CPU 22. Bus 28 represents one or more of any of several types of busstructures, including a memory bus or memory controller, a peripheralbus, an accelerated graphics port, and a processor or local bus usingany of a variety of bus architectures. By way of example, and notlimitation, such architectures include Industry Standard Architecture(ISA) bus, Micro Channel Architecture (MCA) bus, Enhanced ISA (EISA)bus, Video Electronics Standards Association (VESA) local bus, andPeripheral Component Interconnects (PCI) bus.

Memory 30 includes computer system readable media in the form ofvolatile memory 32 and non-volatile or persistent memory 34 which mayinclude, in one embodiment, read-only (ROM). Examples of volatile memory32 are random access memory (RAM) 36 and cache memory 38. Generallyvolatile memory is used because it is faster and generally non-volatilememory is used because it will hold the data for longer. Computerprocessing system 10 may further include other removable and/ornon-removable, volatile and/or non-volatile computer system storagemedia. By way of example only, persistent memory 34 can be provided forreading from and writing to a non-removable, non-volatile magnetic media(not shown and typically a magnetic hard disk or solid-state drive).Although not shown, further storage media may be provided including: anexternal port for removable, non-volatile solid-state memory; and anoptical disk drive for reading from or writing to a removable,non-volatile optical disk such as a compact disk (CD), digital videodisk (DVD) or Blu-ray. In such instances, each can be connected to bus28 by one or more data media interfaces. As will be further depicted anddescribed below, memory 30 may include at least one program producthaving a set (for example, at least one) of program modules that areconfigured to carry out the functions of embodiments of the invention.

The set of program modules configured to carry out the functions of theembodiment comprises encoding and decoding module 200. In oneembodiment, ROM in the memory 30 stores module 200 that enables thecomputer server 12 to function as a special purpose computer specific tothe module 200. Further program modules that support the embodiment butare not shown include firmware, boot strap program, operating system,and support applications. Each of the operating system, supportapplications, other program modules, and program data or somecombination thereof, may include an implementation of a networkingenvironment.

Computer processing system 10 communicates with at least one network 20(such as a local area network (LAN), a general wide area network (WAN),and/or a public network like the Internet) via network adapter 24.Network adapter 24 communicates with the other components of computerserver 12 via bus 28. It should be understood that although not shown,other hardware and/or software components could be used in conjunctionwith computer processing system 10. Examples, include, but are notlimited to: microcode, device drivers, redundant processing units,external disk drive arrays, redundant array of independent disks (RAID),tape drives, and data archival storage systems.

Referring to FIG. 2, encoding and decoding module 200 comprises thefollowing components: cellular space definition data register 202; pathdefinition data register 203; character reading and writing engine 204;next cell determination engine 206; loop facilitator 208; serializationdeserialization engine 210; encoding method 300 and decoding method 400.

The Cellular space definition data register 202 is for storing cellularspace definition data used for defining the cellular data structure forthe encoding and decoding method. In the example the cellular datastructure is a two dimension orthogonal matrix but other dimensions andcoordinate systems can be used.

Path definition data register 203 is for storing the definition for thepaths in the data structure. For instance, a path can be defined by alist of coordinates in the data structure and in the present example ofthe 8 by 8 matrix in FIG. 5A the paths can be defined using chessboardnotation A1 to H8 such that starting at A1, a path starting at the15^(th) cell is defined by the list A1, A2, A3, A4, A5, A6, A7, A8, B8,B7, B6, B5, B4, B3, B2, C2, C3, C4, C5, C6, D6, E6, E7, D7, C7, C8, D8,E8, F8, G8, H8 and so on.

Character reading and writing engine 204 is for reading characters fromand writing characters to the cellular space.

Next cell determination engine 206 is for determining the next cell inthe cellular space.

Loop facilitator 208 is for looping between the character reading andwriting engine 204 and the next cell determination engine 206.

Serialization deserialization engine 210 is for serializing andde-serializing the two dimensional shape into and from serial data.

Encoding method 300 controls the main coding process.

Decoding method 400 controls the main decoding process.

Referring to FIG. 3A, method 300 comprises logical process steps 302 to320 of the embodiment with corresponding example logical process steps302A to 320A describing an example of the embodiment with respect toFIG. 3B. Method 300 starts when a user selects some text or data andthen selects that encoding method 300 be executed on the selected text.

Step 302 is for defining a cellular data structure including a startingempty cell. For example a matrix data structure would be defined by thefollowing parameters: matrix width (MW); matrix height (MH); initialposition (IPos); initial path (IPath); current position (CPos); currentpath (CPath); and string size (SS). Initial position and initial pathare set to n=1 but can be set to any possible value of n. Each positionof the matrix is identified with an index in an index table. The matrixis filled bit by bit, following the sequence of input bits, startingwith an initial position (IPos) and an initial path (IPath).

Step 304 is for defining one or more paths through the data structure.In the example of FIG. 5A to 5E only one path is shown.

Step 306 is for writing a binary character to an empty cell with apredefined initial position. For example, at each step, the nth inputbit IS(n) is written in the nth current position (CPos) along a currentpath (CPath). This is illustrated by step 306A where the value of CPosis set to IS(n) as in the formula CPos.value=IS(n). At the beginning ofthe process, all positions have a status ‘idle’ and are turned ‘busy’once they are filled by an input bit. This is illustrated by step 306Awhere the status of the current position is set to busy as in theformula CPos.status=busy.

Step 308 is for determining a next cell by methodically checking cellsalong the paths in the data structure until a cell is located. In anembodiment the next cell is determined as a function of the currentpath, current position and the binary characters written. For example,after filling the current position (CPos) with the bit from the inputstring IS(n), then the next current position is determined by firstjumping over the next busy positions along the current path and thenjumping zero, one or more idle cells. If CPos is not idle then the nextpath in a path list becomes the current path and CPos is the next idlecell. This is illustrated by step 308A with the formulaCPos=Jump(Cpath,Cpos,IS(n)). An example of different jumps is shown inthe example of FIGS. 5B, 5C and 5D. If binary characters 00 are writtenthen one idle cell is jumped over (jump(00)=1). If binary characters 01are written then two idle cells are jumped over (jump(01)=2). If binarycharacters 10 are written then three idle cells are jumped over(jump(10)=3). If binary characters 11 are written then four idle cellsare subsequently jumped (jump(11)=4).

Step 310 is for determining if the next cell is idle and branching tostep 312 if so. If the cell is not idle then the process branches tostep 316. This is illustrated in step 310A where the status of thecurrent position compared to an idle status with the formulaCPos.status=idle?

Step 312 is for branching to step 314 if there are further datacharacters to process. If there are no more data characters then theprocess branches to step 318. This is illustrated with step 312A wherethe input string counter (n) is compared to the string size (SS) usingthe formula n=SS?

Step 314 is for incrementing the input string counter (n) to the nextbinary character and looping back to step 306 where the writing (step306) and determining (step 308) are performed with respect to the nextbinary character and new current position. This is illustrated with step314A and the formula n=n+1.

Step 316 is for switching to a new path. If there is one only path thenno switch is made. If there are two paths then this step alternatesbetween them. Furthermore a new current possible is located after thebusy cells but using the new path. Next step 312. This is illustrated bystep 316A where the current path is incremented the next current pathusing the formula CPath=Next (CPath). Furthermore the current positionis updated by jumping to the end of the busy cells and no further asillustrated by zero in the formula CPos=Jump(CPath, CPos,0).

Step 318 is for methodically serializing the data structure into a onedimensional binary string of characters representing an encoded stringof alphanumeric characters. This may be performed simply using left toright and top to bottom or by using a further path through the datastructure.

Step 320 is the end of the method.

Referring to FIG. 4A, method 400 comprises logical process steps 402 to420 of the embodiment with corresponding example logical process steps402A to 420A describing an example of the embodiment with respect toFIG. 4B. Method 400 starts when a user selects some encoded text in aninput string and then selects that decoding method 400 be executed onthe selected text to produce a decoded output string.

Step 402 is for defining a cellular data structure including a startingempty cell. For example a matrix data structure would be defined byparameters as shown in example 420A: matrix width (MW); matrix height(MH); initial position (IPos); initial path (IPath); current position(CPos); current path (CPath); and string size (SS). Initial position andinitial path are set to n=1 but can be set to any possible value of n.Each position of the matrix is identified with an index in an indextable. The matrix is filled bit by bit, following the sequence of inputbits, starting with an initial position (IPos) and an initial path(IPath).

Step 404 is for defining one or more paths through the data structure.In the example of FIG. 5A to 5E only one path is shown.

Step 405 is for filling the data structure from the one dimensionalbinary string of characters of the input string representing an encodedstring of alphanumeric characters. This may be performed simply usingleft to right and top to bottom or by using a further path through thedata structure. It is important that filling method used is the logicalopposite of the deserialization method of step 318. This is illustratedin step 405A by setting a cell indexed by i to a value equal to theinput string indexed by I according to the formulacell(index=i).value=IS(i).

Step 406 is for reading a binary character from a cell with a predefinedinitial position. For example, at each step, the nth output string bitis read from the nth current position (CPos) along a current path(CPath). This is illustrated by step 406A where the value of CPos is setto IS(n) as in the formula CPos.value=IS(n). At the beginning of theprocess, all positions have a status ‘idle’ and are turned ‘busy’ oncethey are filled by an input bit.

Step 408 is for determining a next cell as a function of the currentpath, current position and the binary characters written. For example,after filling the output string OS(n) with a but from the currentposition (CPos), then the next current position is determined by firstjumping over the immediate idle positions along the current path to thenext busy cell and then jumping zero, one or more cells depending on theoutput bits. This is illustrated by step 408A with the formulaCPos=Jump(Cpath,Cpos,OS(n)). An example of different jumps is shown inthe example of FIGS. 5B, 5C and 5D. If binary characters 00 are writtenthen one idle cell is jumped over (jump(00)=1). If binary characters 01are written then two idle cells are jumped over (jump(01)=2). If binarycharacters 10 are written then three idle cells are jumped over(jump(10)=3). If binary characters 11 are written then four idle cellsare subsequently jumped (jump(11)=4).

Step 410 is for determining if the next cell is busy and branching tostep 412 if so. If the cell is not busy then the process branches tostep 416. This is illustrated in step 410A where the status of thecurrent position compared to a busy status with the formulaCPos.status=busy?

Step 412 is for branching to step 414 if there are further datacharacters to process. If there are no more data characters then theprocess branches to step 420. This is illustrated with step 412A wherethe output string counter (n) is compared to the string size (SS) usingthe formula n=SS?

Step 414 is for incrementing the output string counter (n) to the nextbinary character and looping back to step 406 where the reading (step406) and determining (step 408) are performed with respect to the nextbinary character and new current position. This is illustrated with step414A and the formula n=n+1.

Step 416 is for switching to a new path. If there is one only path thenno switch is made. If there are two paths then this step alternatesbetween them. Furthermore a new current possible is located after thebusy cells but using the new path. Next step 412. This is illustrated bystep 416A where the current path is set to the next current path usingthe formula CPath=Next (CPath). Furthermore the current position isupdated by jumping to the end of the idle cells and no further asillustrated by zero in the formula CPos=Jump(CPath, CPos,0).

Step 420 is the end of the method.

Referring to FIG. 5A, an example matrix is shown having an example pathstarting (1) at position D4 moving initially (2) to D3, following a pathshown by ascending.

Referring to FIG. 5B, an example of a raw stream and a coded stream. Theraw stream is a sequence of binary numbers “0000 0001 0001 0110 11110110 1111 0001 0011 1001 0111 1011 1010 0000 1101 0101” that representthe hexadecimal numbers “0116F6F1397BA0C5”. The final coded stream is“1010 0110 1110 1100 1010 0001 0010 0000 0101 0011 1101 1000 1001 01111011 0111” representing the hexadecimal numbers “A6ECA12053D897B7”.

FIG. 5C is an example set of initial parameters used to code the exampleof FIG. 5B. Initial Position (IP)=1; Initial Direction (ID)=East;TD=East; ED=East; Pad Width (PW)=8; Pad Height (PH)=8; and String Size(SS)=64.

FIGS. 5D, 5E and 5F together show states of an example pad as it is usedto code the raw stream to the coded stream of the example of FIGS. 5A,5B and 5C. Sixteen pad states are shown numbered 1 to 16.

Pad 1 shows the pad state after being filled with “0000”. The newlyfilled values are in bold and underlined. A bold and underlined arrowshows the current position after a next cell has been determined andafter determined jumps have been made. In this case no jumps have beenmade.

Pad 2 shows the pad state after being filled with “0001”. One cell hasbeen jumped.

Pad 3 shows the pad state after being filled with “0001”. One cell hasbeen jumped.

Pad 4 shows the pad state after being filled with “0110”. One cell hasbeen jumped after the first two bits then two cells are jumped after thenext two bits. The embodiment uses two bits as an easy way to definewhen to jump.

Pad 5 shows the pad state after being filled with “1111”. Three cellshave been jumped after the first two bits and then three cells jumpedafter the next two bits.

Pad 6 shows the pad state after being filled with “0110”. One cell hasbeen jumped after the first two bits and then two cells jumped after thenext two bits.

Pad 7 shows the pad state after being filled with “1111”. Three cellshave been jumped after the first two bits and then three cells jumpedafter the next two bits.

Pad 8 shows the pad state after being filled with “0001”. One cell hasbeen jumped after the last two bits.

Pad 9 shows the pad state after being filled with “0011”. Three cellsjumped after the last two bits.

Pad 10 shows the pad state after being filled with “1001”. Two cellshave been jumped after the first two bits and the next idle cell is nicejumps away. The “01” are written into space between the already busycells but one cell is still jumped after the next two bits have beenwritten.

Pad 11 shows the pad state after being filled with “0111”. One cell hasbeen jumped after the first two bits. Then one cell is jumped after thenext two bits.

Pad 12 shows the pad state after being filled with “1011”. Two cellshave been jumped after the first two bits and then three cells jumpedafter the next two bits.

Pad 13 shows the pad state after being filled with “1010”. Two cellshave been jumped after the first two bits and then two cells jumpedafter the next two bits.

Pad 14 shows the pad state after being filled with “0000”.

Pad 15 shows the pad state after being filled with “1101”.

Pad 16 shows the pad state after being filled with “0101”.

The pad is full and ready to for serialization into coded stream.

Referring to FIG. 6A another example of not yet encoded raw binarystream is “0000 0001 0001 0110 1111 0110 1111 0001 0011 1001 0111 10111010 0000 1101 0101” with corresponding coded binary stream “1010 10001110 1010 1100 0110 0100 0101 0100 1111 1000 1000 0010 1111 1011 0110”.

Referring to FIG. 6B hexadecimal representation of the raw stream is“0116F6F1397BA0C5” and coded stream of 6A is “A8EAC6454F882FB6”.

Referring to FIG. 6C, parameters using in this encoding comprise:initial position (IP)=28; jump(00)=3; jump(01)=4; jump(10)=5;jump(11)=6; matrix width (MW)=8; matrix height (MH)=8; string size(SS)=64; or =−1; and initial path (DP)=A.

Referring to FIG. 6D a representation of a first path (path A) matrix isshown bordered by a dashed line for easy of differentiation.

Referring to FIG. 6E a representation of a second path (path B) matrixis shown bordered by a double line for easy of differentiation. Thisconvention is continued in FIGS. 6G, 6H, 6I and 6J.

Referring to FIG. 6F an order of filling is show representing thecomplex path combination.

Referring to FIG. 6G pad states 1 to 6 a are described.

Pad 1 shows the pad state after being filled with “0000” using complexpath A. The newly filled values are in bold. A bold arrow shows thecurrent position after a next cell has been determined and afterdetermined jumps have been made. In this case three jumps are made aftereach “00”.

Pad 2 shows the pad state after being filled with “0001” using path A.The newly filled values are in bold. A jump of three is made after “00”and a jump of four is made after “01”.

Pad 3 shows the pad state after being filled with “0001” using path A. Ajump of three is made after “00” and a jump of four is made after “01”.

Pad 4 shows the pad state after being filled with “0110” using path A. Ajump of four is made after “01” and a jump of five is made after “10”.

Pad 5 shows the pad state after being filled with “1111” using path A.Two jumps of six are made after each “11”.

Pad 6 a shows the pad state after being filled with “01 . . . ” usingpath A. A “0’ is underlined to indicate where the current cell overlapsa busy cell which is the trigger for switching paths to path B.

Referring to FIG. 6H, pad states 6 b to 9 b are described. Pad 6 b showsthe pad state after being filled with “ . . . 10” using path B. A jumpof four has been made.

Pad 7 a shows the pad state after being filled with “11 . . . ” usingpath B. Six jumps are made. A “0’ is underlined to indicate where thecurrent cell overlaps a busy cell which is the trigger for switchingpaths. The current path is switched to Path A.

Pad 7 b shows the pad state after being filled with “ . . . 11” usingpath A. Six jumps are made.

Pad 8 shows the pad state after being filled with “0001” using A. A jumpof four is made.

Pad 9 a shows the pad state after being filled with “00” using path A. Ajump of three is made. A “0’ is underlined to indicate where the currentcell overlaps a busy cell which is the trigger for switching paths.

Pad 9 b shows the pad state after being filled with “11” using path B. Ajump of six is made. A further “0’ is underlined to indicate where thecurrent cell overlaps a busy cell which is the trigger for switchingpaths.

Referring to FIG. 6I, pad states 10 to 14 a are described. Pad 10 showsthe pad after being filled with “1001” using path A. A jump of five ismade and then a jump of four is made.

Pad 11 shows the pad after being filled with “0111” using path A. A jumpof four is made and then a jump of six is made.

Pad 12 shows the pad after being filled with “1011” using path A. A jumpof five is made and then a jump of six is made.

Pad 13 a shows the pad after being filled with “10” using path A. A “0’is underlined to indicate where the current cell overlaps a busy cellwhich is the trigger for switching paths.

Pad 13 b shows the pad after being filled with “10” using path B. A jumpof five is made. A “1’ is underlined to indicate where the current celloverlaps a busy cell which is the trigger for switching paths.

Pad 14 a shows the pad after being filled with “00” using path A. A jumpof three is made. A “1’ is underlined to indicate where the current celloverlaps a busy cell which is the trigger for switching paths.

Referring to FIG. 6J, pad states 14 b to 16 b are described.

Pad 14 b shows the pad after being filled with “00” using path B. A jumpof three is made. A further “1’ is underlined to indicate where thecurrent cell overlaps a busy cell which is the trigger for switchingpaths.

Pad 15 a shows the pad after being filled with “11” using path A. A jumpof six is made. A “1’ is underlined to indicate where the current celloverlaps a busy cell which is the trigger for switching paths.

Pad 15 b shows the pad after being filled with “01” using path B. Afurther “1’ is underlined to indicate where the current cell overlaps abusy cell which is the trigger for switching paths.

Pad 16 a shows the pad after being filled with “01” using path A. A “1’is underlined to indicate where the current cell overlaps a busy cellwhich is the trigger for switching paths.

Pad 16 b shows the pad after being filled with “01” using path B. Thepad is now full and is serialized to render the coded output string.

Further embodiments of the invention are now described. It will be clearto one of ordinary skill in the art that all or part of the logicalprocess steps of the embodiment may be alternatively embodied in a logicapparatus, or a plurality of logic apparatus, comprising logic elementsarranged to perform the logical process steps of the method and thatsuch logic elements may comprise hardware components, firmwarecomponents or a combination thereof.

It will be equally clear to one of skill in the art that all or part ofthe logic components of the embodiment may be alternatively embodied inlogic apparatus comprising logic elements to perform the steps of themethod, and that such logic elements may comprise components such aslogic gates in, for example, a programmable logic array orapplication-specific integrated circuit. Such a logic arrangement mayfurther be embodied in enabling elements for temporarily or permanentlyestablishing logic structures in such an array or circuit using, forexample, a virtual hardware descriptor language, which may be stored andtransmitted using fixed or transmittable carrier media.

In a further alternative embodiment, the present invention may berealized in the form of a computer implemented method of deploying aservice comprising steps of deploying computer program code operable to,when deployed into a computer infrastructure and executed thereon, causethe computer system to perform all the steps of the method.

It will be appreciated that the method and components of the embodimentmay alternatively be embodied fully or partially in a parallel computingsystem comprising two or more processors for executing parallelsoftware.

A further embodiment of the invention is a computer program productdefined in terms of a system and method. The computer program productmay include a computer-readable storage medium (or media) havingcomputer-readable program instructions thereon for causing a processorto carry out aspects of the present invention.

The computer-readable storage medium can be a tangible device that canretain and store instructions for use by an instruction executiondevice. The computer readable storage medium may be, for example, but isnot limited to, an electronic storage device, a magnetic storage device,an optical storage device, an electromagnetic storage device, asemiconductor storage device, or any suitable combination of theforegoing. A non-exhaustive list of more specific examples of thecomputer readable storage medium includes the following: a portablecomputer diskette, a hard disk, a random access memory (RAM), aread-only memory (ROM), an erasable programmable read-only memory (EPROMor flash memory), a static random access memory (SRAM), a portablecompact disc read-only memory (CD-ROM), a digital versatile disk (DVD),a memory stick, a floppy disk, a mechanically encoded device such aspunch-cards or raised structures in a groove having instructionsrecorded thereon, and any suitable combination of the foregoing. Acomputer readable storage medium, as used herein, is not to be construedas being transitory signals per se, such as radio waves or other freelypropagating electromagnetic waves, electromagnetic waves propagatingthrough a waveguide or other transmission media (for example, lightpulses passing through a fibre-optic cable), or electrical signalstransmitted through a wire.

Computer-readable program instructions described herein can bedownloaded to respective computing/processing devices from a computerreadable storage medium or to an external computer or external storagedevice via a network, for example, the Internet, a local area network, awide area network and/or a wireless network. The network may comprisecopper transmission cables, optical transmission fibres, wirelesstransmission, routers, firewalls, switches, gateway computers and/oredge servers. A network adapter card or network interface in eachcomputing/processing device receives computer-readable programinstructions from the network and forwards the computer-readable programinstructions for storage in a computer readable storage medium withinthe respective computing/processing device.

Computer-readable program instructions for carrying out operations ofthe present invention may be assembler instructions,instruction-set-architecture (ISA) instructions, machine instructions,machine-dependent instructions, microcode, firmware instructions,state-setting data, or either source code or object code written in anycombination of one or more programming languages, including an objectoriented programming language such as Smalltalk, C++ or the like, andconventional procedural programming languages, such as the C programminglanguage or similar programming languages. The computer readable programinstructions may execute entirely on the user's computer, partly on theuser's computer, as a stand-alone software package, partly on the user'scomputer and partly on a remote computer or entirely on the remotecomputer or server. In the latter scenario, the remote computer may beconnected to the user's computer through any type of network, includinga local area network (LAN) or a wide area network (WAN), or theconnection may be made to an external computer (for example, through theInternet using an Internet Service Provider). In some embodiments,electronic circuitry including, for example, programmable logiccircuitry, field-programmable gate arrays (FPGA), or programmable logicarrays (PLA) may execute the computer readable program instructions byutilizing state information of the computer readable programinstructions to personalize the electronic circuitry, in order toperform aspects of the present invention.

Aspects of the embodiments are described herein with reference toflowchart illustrations and/or block diagrams of methods, apparatus(systems), and computer program products. It will be understood thateach block of the flowchart illustrations and/or block diagrams, andcombinations of blocks in the flowchart illustrations and/or blockdiagrams, can be implemented by computer-readable program instructions.

These computer-readable program instructions may be provided to aprocessor of a general purpose computer, special purpose computer, orother programmable data processing apparatus to produce a machine, suchthat the instructions, which execute via the processor of the computeror other programmable data processing apparatus, create means forimplementing the functions/acts specified in the flowchart and/or blockdiagram block or blocks. These computer-readable program instructionsmay also be stored in a computer-readable storage medium that can directa computer, a programmable data processing apparatus, and/or otherdevices to function in a particular manner, such that thecomputer-readable storage medium having instructions stored thereincomprises an article of manufacture including instructions whichimplement aspects of the function/act specified in the flowchart and/orblock diagram block or blocks.

The computer-readable program instructions may also be loaded onto acomputer, other programmable data processing apparatus, or other deviceto cause a series of operational steps to be performed on the computer,other programmable apparatus or other device to produce a computerimplemented process, such that the instructions which execute on thecomputer, other programmable apparatus, or other device implement thefunctions/acts specified in the flowchart and/or block diagram block orblocks.

The flowchart and block diagrams in the figures illustrate thearchitecture, functionality, and operation of possible implementationsof systems, methods, and computer program products according to variousembodiments of the present invention. In this regard, each block in theflowchart or block diagrams may represent a module, segment, or portionof instructions, which comprises one or more executable instructions forimplementing the specified logical function(s). In some alternativeimplementations, the functions noted in the block may occur out of theorder noted in the figures. For example, two blocks shown in successionmay, in fact, be executed substantially concurrently, or the blocks maysometimes be executed in the reverse order, depending upon thefunctionality involved. It will also be noted that each block of theblock diagrams and/or flowchart illustration, and combinations of blocksin the block diagrams and/or flowchart illustration, can be implementedby special purpose hardware-based systems that perform the specifiedfunctions or acts or carry out combinations of special purpose hardwareand computer instructions.

It will be clear to one skilled in the art that many improvements andmodifications can be made to the foregoing exemplary embodiment withoutdeparting from the scope of the present invention.

1. A system for encoding an input string of characters, comprising: apath definition defining a path through a data structure; a characterreading and writing engine for writing a next character to an empty cellin the data structure with a predefined initial position; a next celldetermination engine for determining a next empty cell by checking cellsalong the path in the data structure until an empty cell is located; aloop facilitator for looping back to the next character writing step andthe determining next empty cell step for an additional data character;and an engine for serializing the data structure into a string ofcharacters representing an encoded string of characters.
 2. A systemaccording to claim 1, wherein the loop facilitator is further configuredto loop back to the next character writing step and the determining nextempty cell step until all cells are full.
 3. A system according to claim1, wherein checking cells along the path comprises traversing cells fromthe current cell in a current direction along the path to a new cell andwherein the new cell is the next cell if the new cell is an empty cellotherwise traversing again until an empty cell is located.
 4. A systemaccording to claim 1, wherein checking comprises jumping over one ormore empty cells depending on conditions.
 5. A system according to claim1, further comprising changing to a new path to locate an empty cell. 6.A system according to claim 1, further comprising changing a currentdirection if a particular character has been written.
 7. A systemaccording to claim 6, wherein using a different direction occurs iftraversing in the current direction would cross a boundary of the datastructure.
 8. A system according to claim 7, wherein the currentdirection changes to an opposite direction if the current directionwould cross a boundary of a shape.
 9. A method of encoding an inputstring of characters, comprising: writing a character to an empty cellin a data structure; determining a next empty cell in the data structureby checking cells along a path in the data structure until an empty cellis located; looping back to the character writing step and thedetermining next empty cell step for an additional data character; andserializing the data structure into a string of characters representingan encoded string of characters.
 10. A method according to claim 9,wherein the looping further includes looping back to the next characterwriting step and the determining next empty cell step until all cellsare full.
 11. A method according to claim 9, wherein checking cellsalong the path comprises traversing cells from the current cell in acurrent direction along the path to a new cell and wherein the new cellis the next cell if the new cell is an empty cell otherwise traversingagain until an empty cell is located.
 12. A method according to claim 9,wherein checking cells comprises jumping over one or more empty cellsdepending on conditions.
 13. A method according to claim 9, furthercomprising changing to a new path to locate an empty cell.
 14. A methodaccording to claim 9, further comprising changing a current direction ifa particular character has been written.
 15. A method according to claim14, wherein using a different direction occurs if traversing in thecurrent direction would cross a boundary of the data structure.
 16. Amethod according to claim 15, wherein the current direction changes toan opposite direction if the current direction would cross a boundary ofa shape.
 17. A computer program product comprising a computer-readablestorage medium having computer-readable program code embodied therewith,the computer-readable program code configured to perform a method forencoding an input string of characters when executed by a computersystem, the method comprising: writing a character to an empty cell of adata structure; determining a next empty cell in the data structure bychecking cells along a path in the data structure until an empty cell islocated; looping back to the character writing step and the determiningnext empty cell step for an additional data character; and serializingthe data structure into a string of characters representing an encodedstring of characters.
 18. A program product according to claim 17,wherein checking cells along the path comprises traversing cells fromthe current cell in a current direction along the path to a new cell andwherein the new cell is the next cell if the new cell is an empty cellotherwise traversing again until an empty cell is located.
 19. A programproduct according to claim 17, further comprising changing to a new pathto locate an empty cell.
 20. A program product according to claim 17,further comprising changing a current direction if a particularcharacter has been written.
 21. A program product according to claim 20,wherein using a different direction occurs if traversing in the currentdirection would cross a boundary of the data structure.
 22. A programproduct according to claim 21, wherein the current direction changes toan opposite direction if the current direction would cross a boundary ofa shape.
 23. A program product according to claim 17, wherein thelooping further includes looping back to the next character writing stepand the determining next empty cell step until all cells are full.